import sys
input = sys.stdin.readline
def mp():return list(map(int,input().split()))
def it():return int(input())
import math
mod=10**9+7
def solve():
n,a,b,k=mp()
s=input().strip()
tmp,ans=0,[]
for i in range(n):
if s[i]=='1':
tmp=0
else:
tmp+=1
if tmp==b:
ans.append(i+1)
tmp=0
ret=len(ans)-(a-1)
print(ret)
print(" ".join(map(str,ans[:ret])))
return
if __name__ == '__main__':
solve()
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |